Tractability through increasing smoothness
نویسندگان
چکیده
منابع مشابه
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithmically increasing smoothness. This is demonstrated for the approximation problem defined over Korobov spaces and for the approximation problem of certain diagonal operators. For these two problems we show necessary and...
متن کاملHexagonal Smoothness-Increasing Accuracy-Conserving Filtering
DiscontinuousGalerkin (DG)methods are a popular class of numerical techniques to solve partial differential equations due to their higher order of accuracy. However, the interelement discontinuity of a DG solution hinders its utility in various applications, including visualization and feature extraction. This shortcoming can be alleviated by postprocessing of DG solutions to increase the inter...
متن کاملOne-Sided Smoothness-Increasing Accuracy-Conserving Filtering for Enhanced Streamline Integration through Discontinuous Fields
The discontinuous Galerkin (DG) method continues to maintain heightened levels of interest within the simulation community because of the discretization flexibility it provides. One of the fundamental properties of the DG methodology and arguably its most powerful property is the ability to combine high-order discretizations on an inter-element level while allowing discontinuities between eleme...
متن کاملTractability of multivariate approximation over a weighted unanchored Sobolev space: Smoothness sometimes hurts
We study d-variate L2-approximation for a weighted unanchored Sobolev space having smoothness m ≥ 1. Folk wisdom would lead us to believe that this problem should become easier as its smoothness increases. This is true if we are only concerned with asymptotic analysis: the nth minimal error is of order n for any δ > 0. However, it is unclear how long we need to wait before this asymptotic behav...
متن کاملTractability through Exchangeability: A New Perspective on Efficient Probabilistic Inference
Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical property that renders probabilistic inference tractable is less well-understood. We develop a theory of finite exchangeability and its relation to tractable probab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2010
ISSN: 0885-064X
DOI: 10.1016/j.jco.2009.12.004